On linear recurrences with constant coefficients
نویسندگان
چکیده
منابع مشابه
Linear recurrences with constant coefficients: the multivariate case
While in the univariate case solutions of linear recurrences with constant coe cients have rational generating functions we show that the multivariate case is much richer even though initial conditions have rational generating functions the corresponding solutions can have generating functions which are algebraic but not rational D nite but not algebraic and even non D nite Introduction The aim...
متن کاملBounds for Linear Recurrences with Restricted Coefficients
This paper derives inequalities for general linear recurrences. Optimal bounds for solutions to the recurrence are obtained when the coefficients of the recursion lie in intervals that include zero. An important aspect of the derived bounds is that they are easily computable. The results bound solutions of triangular matrix equations and coefficients of ratios of power series.
متن کاملThe Automatic Solution of Recurrence Relations I. Linear Recurrences of Finite Order with Constant Coefficients
We describe algorithmic techniques for the efficient solution of awide class of linear recurrences of finite order with constant coefficients.We give an outline of the underlying theory both from an abstract anda more concrete point of view, in an attempt to convey the generalprinciples as clearly as possible yet providing a well marked path forthe implementation. In par...
متن کاملLinear Differential Algebraic Equations with Constant Coefficients
Differential-algebraic equations (DAEs) arise in a variety of applications. Their analysis and numerical treatment, therefore, plays an important role in modern mathematics. The paper gives an introduction to the topics of DAEs. Examples of DAEs are considered showing their importance for practical problems. Some essential concepts that are really essential for understanding the DAE systems are...
متن کاملDefinite Sums as Solutions of Linear Recurrences With Polynomial Coefficients
We present an algorithm which, given a linear recurrence operator L with polynomial coefficients, m ∈ N \ {0}, a1, a2, . . . , am ∈ N \ {0} and b1, b2, . . . , bm ∈ K, returns a linear recurrence operator L ′ with rational coefficients such that for every sequence h,
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Arkiv för Matematik
سال: 1958
ISSN: 0004-2080
DOI: 10.1007/bf02589493